Dynamics of Finite Semigroups

Decidability and Tameness in the Theory of Finite Semigroups

Classification of Monogenic Ternary Semigroups

The aim of this paper is to classify all monogenic ternary semigroups, up to isomorphism. We divide them to two groups: finite and infinite. We show that every infinite monogenic ternary semigroup is isomorphic to the ternary semigroup O, the odd positive integers with ordinary addition. Then we prove that all finite monogenic ternary semigroups with the same index...

On the Graphs Related to Green Relations of Finite Semigroups

In this paper we develop an analog of the notion of the con- jugacy graph of  nite groups for the  nite semigroups by considering the Green relations of a  nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a  nite semigroup S , we  first atte...

Profinite Structures and Dynamics

Surprising as it may be at first sight, there are a number of connections between the theories of finite semigroups and dynamical systems, both viewed in a broad sense. For instance in symbolic dynamics, ideas or analogies from the theory of finite automata find a natural setting for application in sofic systems [10, 24] and, even though not usually formulated in dynamical terms, the dynamical ...

Finite Aperiodic Semigroups with Commuting Idempotents and Generalizations

Among the most important and intensively studied classes of semigroups are finite semigroups, regular semigroups and inverse semigroups. Finite semigroups arise as syntactic semigroups of regular languages and as transition semigroups of finite automata. This connection has lead to a large and deep literature on classifying regular languages by means of algebraic properties of their correspondi...